A digraph has a Hamiltonian path if there exists
a sequence of arcs that traverses the digraph in such a way that each vertex is visited exactly once without returning to the starting point.